Scalability analysis and parallel execution of unstructured problems
نویسندگان
چکیده
Unstructured parallelism is the hardest problem to analyze and to program. In this paper we present a generic approach TGEX for analyzing and executing unstructured problems. It separates the speciication of a computational problem from the control of the parallel execution. A computational problem is rst partitioned in terms of a computation task graph which serves as a machine-independent representation of the parallel program. This allows fast and accurate performance simulation with the Pamela tool and eecient parallel execution. Experimental results of using Pamela and TGEX for scalability analysis and parallel execution of unstructured problems are reported. 1
منابع مشابه
Scalability analysis and parallel execution of unstructured problemsHai
Unstructured parallelism is the hardest problem to analyze and to program. In this paper we present a generic approach TGEX for analyzing and executing unstructured problems. It separates the speciication of a computational problem from the control of the parallel execution. A computational problem is rst partitioned in terms of a computation task graph which serves as a machine-independent rep...
متن کاملDesign and initial performance of a high-level unstructured mesh framework on heterogeneous parallel systems
OP2 is a high-level domain specific library framework for the solution of unstructured mesh-based applications. It utilizes source-to-source translation and compilation so that a single application code written using the OP2 API can be transformed into multiple parallel implementations for execution on a range of back-end hardware platforms. In this paper we present the design and performance o...
متن کاملParallelization of a Dynamic Unstructured Algorithm Using Three Leading Programming Paradigms
The success of parallel computing in solving real-life computationally-intensive problems relies on their efficient mapping and execution on large-scale multiprocessor architectures. Many important applications are both unstructured and dynamic in nature, making their efficient parallel implementation a daunting task. This paper presents the parallelization of a dynamic unstructured mesh adapta...
متن کاملParallel Smoothers for Matrix-based Multigrid Methods on Unstructured Meshes Using Multicore CPUs and GPUs
Multigrid methods are efficient and fast solvers for problems typically modeled by partial differential equations of elliptic type. For problems with complex geometries and local singularities stencil-type discrete operators on equidistant Cartesian grids need to be replaced by more flexible concepts for unstructured meshes in order to properly resolve all problem-inherent specifics and for mai...
متن کاملA Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time of a coloring algorithm adds to the overall parallel overhead of the application whereas the number of colors used determines the amount of ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996